Description: 实现二维基本图元直线段生成的基本算法（DDA，中点法，Bresenham）实现二维基本图元圆弧/椭圆圆弧生成的基本算法（中点法）实现对线型线宽的属性的控制实现二维多边形扫描转换的扫描线算法实现二维多边形扫描转换的边缘填充算法或栅栏填充算法实现二维连通区域填充的扫描线种子填充算法（四连通或八连通）实现二维直线段裁剪的Cohen-Sutherland裁剪算法和中点分割裁剪算法-basic 2D linear map of the yuan generated by the basic algorithm (DDA, the midpoint method, Bresenham) basic 2D map yuan Arc / elliptical arc generated by the basic algorithm (midpoint) to achieve linear linewidth control of the attributes of 2D polygon scan conversion algorithm scanning 2D polygon scan conversion Edge geo-filling algorithm fence or filling algorithm regional connectivity filled two-dimensional scanning lines seed filling algorithm (four or eight connectivity connectivity ) 2D linear cut of the Cohen-Sutherland cutting midpoint segmentation algorithm and cutting algorithm Platform: |
Size: 228823 |
Author:张伟 |
Hits:
Description: 《计算机图形学》
实验一 基本图形的生成
实验目的：
1、编写直线的DDA和Bresenham算法的实现程序，验证算法的正确性。
2、编写圆的Bresenham算法或中点算法的实现程序，验证算法的正确性。
3、用多边形的扫描线填充算法对一多边形进行填充，验证算法的正确性。
4、使用Cohen-Sutherland算法裁减二维线段或使用Sutherland-Hodgman算法对多边形进行裁减，验证算法的正确性。
5、通过算法的编写，切实掌握图形学中直线和圆生成的原理以及图形填充和裁减算法的原理和过程。
实验内容：
1、（必做）编写直线的DDA和Bresenham算法的实现程序。要求：直线的起点与终点坐标通过文本框中输入或添加鼠标程序，实现交互式画直线（用鼠标确定直线的起点和终点）。禁止使用画直线的系统函数。
2、（必做）编写圆的Bresenham算法或中点算法的实现程序。要求：圆的半径与圆心点坐标通过文本框中输入或添加鼠标程序，实现交互式画圆（用鼠标确定圆的圆心和半径）。禁止使用画圆的系统函数。
-"Computer Graphics" experiment, a basic pattern formation of the experiment : 1. DDA prepared a straight line and the Bresenham algorithm procedures, verification algorithm is correct. 2, the preparation of a round of the Bresenham algorithm or midpoint algorithm implementation procedures, verification algorithm is correct. 3, using the polygon scan line algorithm to fill a polygon filling, the verification algorithm correctness. 4. Use Cohen-Sutherland algorithm line or two-dimensional reduction of the use of Sutherland - Hodgman algorithm for polygon reduction, the certification algorithm correctness. 5, algorithm development, really control the graphics linear and circular formation of principle and graphics filling algorithm and the reduction of the principles and processes. Platform: |
Size: 44947 |
Author:fisherman |
Hits:
Description: 直线段的裁剪和绘制，1、自由曲线包括：二次、三次Bezier曲线，二次、三次均匀B样条曲线；
2、Bezier曲线的实现算法要求选用细分算法；
3、均匀B样条曲线过控制多边形的首末顶点；
4、利用B样条曲线的局部控制性来动态修改曲线形状；
5、界面设计友好、几何直观。
裁剪算法选用Cohen-Sutherland算法；
-straight of the cutting and painting, a free curve include : second, third Bezier curves, second, Third uniform B-spline curves; 2, Bezier curve algorithm selection requirements subdivision algorithm; 3. Uniform B-spline curve control over the end of the first polygon vertices; 4. B-spline curves of local control to dynamically change curve shape; 5, friendly interface design, visual geometry. Cutting Algorithm Selection Cohen-Sutherland algorithm; Platform: |
Size: 331797 |
Author:rtshen |
Hits:
Description: 实现二维基本图元直线段生成的基本算法（DDA，中点法，Bresenham）实现二维基本图元圆弧/椭圆圆弧生成的基本算法（中点法）实现对线型线宽的属性的控制实现二维多边形扫描转换的扫描线算法实现二维多边形扫描转换的边缘填充算法或栅栏填充算法实现二维连通区域填充的扫描线种子填充算法（四连通或八连通）实现二维直线段裁剪的Cohen-Sutherland裁剪算法和中点分割裁剪算法-basic 2D linear map of the yuan generated by the basic algorithm (DDA, the midpoint method, Bresenham) basic 2D map yuan Arc/elliptical arc generated by the basic algorithm (midpoint) to achieve linear linewidth control of the attributes of 2D polygon scan conversion algorithm scanning 2D polygon scan conversion Edge geo-filling algorithm fence or filling algorithm regional connectivity filled two-dimensional scanning lines seed filling algorithm (four or eight connectivity connectivity ) 2D linear cut of the Cohen-Sutherland cutting midpoint segmentation algorithm and cutting algorithm Platform: |
Size: 228352 |
Author:张伟 |
Hits:
Description: 用Cohen算法实现多边形的裁剪,可以输入任意多边形实现裁剪.-Cohen algorithm using the polygon clipping, arbitrary polygon can be imported to achieve cutting. Platform: |
Size: 1024 |
Author:陈芳洲 |
Hits:
Description: 《计算机图形学》
实验一 基本图形的生成
实验目的：
1、编写直线的DDA和Bresenham算法的实现程序，验证算法的正确性。
2、编写圆的Bresenham算法或中点算法的实现程序，验证算法的正确性。
3、用多边形的扫描线填充算法对一多边形进行填充，验证算法的正确性。
4、使用Cohen-Sutherland算法裁减二维线段或使用Sutherland-Hodgman算法对多边形进行裁减，验证算法的正确性。
5、通过算法的编写，切实掌握图形学中直线和圆生成的原理以及图形填充和裁减算法的原理和过程。
实验内容：
1、（必做）编写直线的DDA和Bresenham算法的实现程序。要求：直线的起点与终点坐标通过文本框中输入或添加鼠标程序，实现交互式画直线（用鼠标确定直线的起点和终点）。禁止使用画直线的系统函数。
2、（必做）编写圆的Bresenham算法或中点算法的实现程序。要求：圆的半径与圆心点坐标通过文本框中输入或添加鼠标程序，实现交互式画圆（用鼠标确定圆的圆心和半径）。禁止使用画圆的系统函数。
-"Computer Graphics" experiment, a basic pattern formation of the experiment : 1. DDA prepared a straight line and the Bresenham algorithm procedures, verification algorithm is correct. 2, the preparation of a round of the Bresenham algorithm or midpoint algorithm implementation procedures, verification algorithm is correct. 3, using the polygon scan line algorithm to fill a polygon filling, the verification algorithm correctness. 4. Use Cohen-Sutherland algorithm line or two-dimensional reduction of the use of Sutherland- Hodgman algorithm for polygon reduction, the certification algorithm correctness. 5, algorithm development, really control the graphics linear and circular formation of principle and graphics filling algorithm and the reduction of the principles and processes. Platform: |
Size: 718848 |
Author:fisherman |
Hits:
Description: 直线段的裁剪和绘制，1、自由曲线包括：二次、三次Bezier曲线，二次、三次均匀B样条曲线；
2、Bezier曲线的实现算法要求选用细分算法；
3、均匀B样条曲线过控制多边形的首末顶点；
4、利用B样条曲线的局部控制性来动态修改曲线形状；
5、界面设计友好、几何直观。
裁剪算法选用Cohen-Sutherland算法；
-straight of the cutting and painting, a free curve include : second, third Bezier curves, second, Third uniform B-spline curves; 2, Bezier curve algorithm selection requirements subdivision algorithm; 3. Uniform B-spline curve control over the end of the first polygon vertices; 4. B-spline curves of local control to dynamically change curve shape; 5, friendly interface design, visual geometry. Cutting Algorithm Selection Cohen-Sutherland algorithm; Platform: |
Size: 331776 |
Author:rtshen |
Hits:
Description: 了解二维图形裁剪的原理（点的裁剪、直线的裁剪、多边形的裁剪），利用VC+OpenGL实现直线的裁剪算法。
2．实验内容：
（1） 理解直线裁剪的原理（Cohen-Surtherland算法、梁友栋算法）
（2） 利用VC+OpenGL实现直线的编码裁剪算法，在屏幕上用一个封闭矩形裁剪任意一条直线。
（3） 调试、编译、修改程序
-Understanding of the principles of cutting two-dimensional graphics (point of cutting, cutting a straight line, polygon clipping), the use of VC+ OpenGL to achieve a straight line cutting algorithm. 2. Experimental contents: (1) understand the principles of cutting a straight line (Cohen-Surtherland algorithm, You-Xin Liang Dong algorithm) (2) the use of VC+ OpenGL to achieve a straight line cutting the coding algorithm, on the screen in a closed arbitrary rectangular cutting a straight line. (3) debug, compile, modify the program Platform: |
Size: 566272 |
Author:jing |
Hits:
Description: 在定义了窗口之后，我们只需将窗口内的图形显示出来，对于窗口之外的图形我们是不关心的。因此，必须将窗口外的图形裁剪下去。在本资料中，实现如下对直线段进行裁剪的算法：Cohen-Sutherland算法、中点分割算法、梁友栋-Barsky算法，并且利用Sutherland-Hodgman算法实现对多边形的裁剪，最后，实现当裁剪域是任意凸多边形时的裁剪算法。-In the definition of the window, we simply window graphics are displayed, in addition to window graphics we are not concerned. Therefore, the need to cut down the graphics outside the window. In this data, to achieve the following sections of the cut line algorithm: Cohen-Sutherland algorithm, the mid-point division algorithm, Liangyou Dong-Barsky algorithm, and using Sutherland-Hodgman polygon clipping algorithm, and finally, to achieve when the cutting domain is arbitrary when the convex polygon clipping algorithm. Platform: |
Size: 1958912 |
Author:秀 |
Hits:
Description: 在定义了窗口之后，我们只需将窗口内的图形显示出来，对于窗口之外的图形我们是不关心的。因此，必须将窗口外的图形裁剪下去。在本资料中，实现如下对直线段进行裁剪的算法：Cohen-Sutherland算法、中点分割算法、梁友栋-Barsky算法，并且利用Sutherland-Hodgman算法实现对多边形的裁剪，最后，实现当裁剪域是任意凸多边形时的裁剪算法。-In the definition of the window, we simply window graphics are displayed, in addition to window graphics we are not concerned. Therefore, the need to cut down the graphics outside the window. In this data, to achieve the following sections of the cut line algorithm: Cohen-Sutherland algorithm, the mid-point division algorithm, Liangyou Dong-Barsky algorithm, and using Sutherland-Hodgman polygon clipping algorithm, and finally, to achieve when the cutting domain is arbitrary when the convex polygon clipping algorithm. Platform: |
Size: 1959936 |
Author:秀 |
Hits:
Description: 该程序包含两部分，一部分使用扫描线区域填充算法完成多边形的扫描显示，另一部分使用Cohen-Sutherland算法实现直线裁剪-The program consists of two parts, using the scan line polygon area fill algorithm scans showed complete, the other using the Cohen-Sutherland line clipping algorithm Platform: |
Size: 274432 |
Author:sjgao |
Hits:
Description: MFC做的图形处理，关于线段的裁剪，包括参数化法的凸多边形裁剪算法和Cohen-SutherLand裁剪算法。-MFC to do graphics processing, cut on the line, including the parameterization of the convex polygon clipping algorithm, and Cohen-Sutherland clipping algorithm. Platform: |
Size: 4758528 |
Author:zengyong |
Hits:
Description: 实现二维扫描转换多边形的扫描线算法
实现二维连通区域填充的种子填充算法（四连通或八连通）
实现二维直线段裁剪的Cohen-Sutherland裁剪算法和中点分割裁剪算法
-Realization of two-dimensional polygon scan conversion algorithm dimensional scan line connected region filled seed filling algorithm (four or eight connectivity connectivity) Cohen-Sutherland clipping algorithm to achieve the midpoint of the two-dimensional linear cut and split clipping algorithm Platform: |
Size: 193536 |
Author:沈亦苏 |
Hits:
Description: 实验四
编程实现Cohen-Sutherland线段裁剪算法或者Sutherland-Hodgman多边形裁剪算法
对各种情况进行测试，验证算法实现的完整性
-Experiments four programming Cohen-Sutherland line clipping algorithm or Sutherland-Hodgman polygon clipping algorithms for testing a variety of situations, to verify the integrity algorithm Platform: |
Size: 221184 |
Author:林伟鸿 |
Hits:
Description: 实验四
编程实现Cohen-Sutherland线段裁剪算法或者Sutherland-Hodgman多边形裁剪算法
对各种情况进行测试，验证算法实现的完整性
-Experiments four programming Cohen-Sutherland line clipping algorithm or Sutherland-Hodgman polygon clipping algorithms for testing a variety of situations, to verify the integrity algorithm Platform: |
Size: 223232 |
Author:林伟鸿 |
Hits:
Description: 采用Sutherland-Hodeman多边形裁剪算法和Cohen-Sutherland直线裁减算法在java界面实现(The implementation of the Sutherland-Hodeman polygon clipping algorithm and the Cohen-Sutherland line reduction algorithm in the java interface) Platform: |
Size: 4096 |
Author:李木华 |
Hits:
Search - cohen-sutherland polygon